Critical evaluation of gas standards based on hydrogen

Summary Six commercial hydrogen standards containing helium, oxygen, nitrogen, methane and carbon dioxide at trace levels were analyzed by gas chromatography, for periods up to 105 days. The concentrations, in the range of 0–120 μmol mol⁻¹, were stable (with the exception of oxygen) but often significantly different from the certified values provided by the suppliers, especially for helium, oxygen and nitrogen. Concurrently, some experiments were carried out to verify the stability of gas mixtures based on hydrogen stored in cylinders submitted to different chemical and physical treatments. The causes that led to the deviations observed, as well as the decreases in oxygen, are discussed. Presented at the 21^st ISC held in Stuttgart, Germany, 15^th–20^th September, 1996.     

NOTE ON THE OSCILLATION OF THE SOLUTION FOR GENERALIZED LIENARD EQUATIONS

Ｃｏｎｓｉｄｅｒｉｎｇｓｙｓｔｅｍ：ｘ＝φ（ｙ）－Ｆ（ｘ），ｙ＝－ｇ（ｘ）｛（Ｅ）ｉｎｗｈｉｃｈＦ（ｘ）＝∫ｘ０ｆ（ｔ）ｄｔ，ｆ（ｘ），ｇ（ｘ），φ（ｙ）ａｒｅｃｏｎｔｉｎｕｏｕｓ，ａｎｄｓａｔｉｓｆｙｔｈｅｃｏｎｄｉｔｉｏｎｓｗｈｉｃｈｅｎｓｕｒ...     

具有两台专用机,两台通用机的Q4／／Cmax问题的近似算法

本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4／／Cmax问题，对这类特殊的排序问题，提出一种启发式算法，得到了最差情况下性能指标的严格的界．     

Estimates for the Rapid Decay of Concentration Functions of n-Fold Convolutions

We estimate the concentration functions of n-fold convolutions of one-dimensional probability measures. The Kolmogorov–Rogozin inequality implies that for nondegenerate distributions these functions decrease at least as O(n ^–1/2). On the other hand, Esseen⁽³⁾ has shown that this rate is o(n ^–1/2) iff the distribution has an infinite second moment. This statement was sharpened by Morozova.⁽⁹⁾ Theorem 1 of this paper provides an improvement of Morozova's result. Moreover, we present more general estimates which imply the rates o(n ^–1/2).     

转动系统的相对论性分析力学理论

本文讨论了转动相对论力学理论，主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Ｔｒ＝∑ｎｉ＝１Ｉ０ｉΓｉ２（１－１－θ·２ｉ／Γｉ２）和广义加速度能量函数Ｓｒ＝１２∑ｎｉ＝１Ｉｉ（θ·ｉ·θ¨ｉ）２Γｉ２－θ·２ｉ＋θ¨２ｉ，给出其Ｈａｍｉｌｔｏｎ原理和三种不同形式的Ｄ′Ａｌｅｍｂｅｒｔ原理；对于完整约束系统，建立了转动系统的相对论性Ｌａｇｒａｎｇｅ方程、Ｎｉｅｌｓｅｎ方程、Ａｐｐｅｌ方程和Ｈａｍｉｌｔｏｎ正则方程；对于非完整约束系统，建立了转动系统的相对论性Ｒｏｕｔｈ方程、Чаплыгин方程、Ｎｉｅｌｓｅｎ方程和Ａｐｐｅｌ方程；并给出转动系统的相对论性Ｎｏｅｔｈｅｒ守恒律     

Variable resolution triangulations

A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A general model is introduced, called a Multi-Triangulation (MT), which is based on a collection of fragments of triangulations arranged into a directed acyclic graph. Different decompositions of a domain can be obtained by combining different fragments of the model. Theoretical results on the expressive power of the MT are given. An efficient algorithm is proposed that can extract a triangulation from the MT, whose level of detail is variable over the domain according to a given threshold function. The algorithm works in linear time, and the extracted representation has minimum size among all possible triangulations that can be built from triangles in the MT, and that satisfy the given level of detail. Major applications of these results are in real-time rendering of complex surfaces, such as topographic surfaces in flight simulation.     

Bellman最优性原理——论动态规划(Ⅰ)

对于Bellman最优性原理,本文举出实例表明:(1)策略不一定有(合理的)子策略;(2)子策略不一定存在最优子策略;(3)最优策略不一定有最优子策略;(4)用最短路与反证法来论述最优性原理的正确性,不能肯定成立;(5)Bellman最优性原理与其递推公式并不等价。 讨论四类最优策略之后,给出最优性原理与递推公式等价的一个充分性定理。     

WEAK CONVERGENCE OF HENSTOCK INTEGRABLE SEQUENCES

Some relationships between pointwise and weak convergence of a sequence of Henstock integrable functions are studied, In particular it is provided an example of a sequence of Henstock integrable functions whose pointwise limit is different from the weak one. By introducing an asymptotic version of the Henstock equiintegrability notion it is given a necessary and sufficient condition in order that a pointwisely convergent sequence of Henstock integrable functions is weakly convergent to its pointwise limit.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.